Some Results on Perfect, Static-Key Hashing
نویسندگان
چکیده
منابع مشابه
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each key can be retrieved from the table with a single probe. A minimal perfect hash function (MPHF) is a PHF with the smallest possible range, that is, the hash table size is exactly the number of keys in S. MPHFs are wide...
متن کاملA Letter-oriented Perfect Hashing Scheme Based upon Sparse Table Compression
In this paper, a new letter-oriented perfect hashing scheme based on Ziegler’s row displacement method is presented. A unique n -tuple from a given set of static letter-oriented key words can be extracted by a heuristic algorithm. Then the extracted distinct n -tuples are associated with a 0/1 sparse matrix. Using a sparse matrix compression technique, a perfect hashing function on the key word...
متن کاملQuasi-Perfect Hashing
The idea of quasi-perfect hashing is introduced and applied to solve the static dictionary problem. Given a universe U and a set S of n distinct keys belonging to U , we propose a quasi-perfect hash function which allows one to find a key from S, stored in the hash table of size m, m ≥ n, in O(1) time. While looking up a key at most two probes in the hash table are made. Our main motivation is ...
متن کاملPractical perfect hashing in nearly optimal space
A hash function is a mapping from a key universe U to a range of integers, i.e., h : U/f0;1, . . . ,m 1g, where m is the range’s size. A perfect hash function for some set SDU is a hash function that is one-to-one on S, where mZ9S9. A minimal perfect hash function for some set SDU is a perfect hash function with a range of minimum size, combines theoretical analysis, practical performance, expe...
متن کاملCuckoo Hashing
We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...
متن کامل